Convergence orders of iterative methods for nonlinear eigenvalue problems
نویسندگان
چکیده
The convergence analysis of iterative methods for nonlinear eigenvalue problems is in the most cases restricted either to algebraic simple eigenvalues or to polynomial eigenvalue problems. In this paper we consider two classical methods for general holomorphic eigenvalue problems, namely the nonlinear generalized Rayleigh quotient iteration (NGRQI) and the augmented Newton method. For both methods we prove local quadratic convergence for semi–simple eigenvalues. For defective eigenvalues local linear convergence is shown for the NGRQI. The key tool of our analysis is the representation of the eigenvalues as poles of the resolvent which is a classical result in operator theory. The convergence orders of the mentioned methods depend on the order of the poles of the resolvent. In numerical experiments the theoretical results are verified.
منابع مشابه
Two new three and four parametric with memory methods for solving nonlinear equations
In this study, based on the optimal free derivative without memory methods proposed by Cordero et al. [A. Cordero, J.L. Hueso, E. Martinez, J.R. Torregrosa, Generating optimal derivative free iterative methods for nonlinear equations by using polynomial interpolation, Mathematical and Computer Modeling. 57 (2013) 1950-1956], we develop two new iterative with memory methods for solving a nonline...
متن کاملOne Approach to Construction of Bilateral Approximations Methods for Solution of Nonlinear Eigenvalue Problems
In this paper a new approach to construction of iterative methods of bilateral approximations of eigenvalue is proposed and investigated. The conditions on initial approximation, which ensure the convergence of iterative processes, are obtained.
متن کاملSolving systems of nonlinear equations using decomposition technique
A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...
متن کاملNew iterative methods with seventh-order convergence for solving nonlinear equations
In this paper, seventh-order iterative methods for the solution ofnonlinear equations are presented. The new iterative methods are developed byusing weight function method and using an approximation for the last derivative,which reduces the required number of functional evaluations per step. Severalexamples are given to illustrate the eciency and the performance of the newiterative methods.
متن کاملAdaptive Steffensen-like Methods with Memory for Solving Nonlinear Equations with the Highest Possible Efficiency Indices
The primary goal of this work is to introduce two adaptive Steffensen-like methods with memory of the highest efficiency indices. In the existing methods, to improve the convergence order applied to memory concept, the focus has only been on the current and previous iteration. However, it is possible to improve the accelerators. Therefore, we achieve superior convergence orders and obtain as hi...
متن کامل